Polynomial time learnability of simple deterministic languages
نویسندگان
چکیده
منابع مشابه
Polynomial Time Learnability of Simple Deterministic Languages from MAT and a Representative Sample
We propose a learning algorithm for simple deterministic languages from queries and a priori knowledge. To the learner, a special finite subset of the target language, called a representative sample, is provided at the beginning and two types of queries, equivalence queries and membership queries, are available. This learning algorithm constructs nonterminals of a hypothesis grammar based on Is...
متن کاملPolynomial time learning of simple deterministic languages via queries and a representative sample
We show that simple deterministic languages are polynomial time learnable viamembership queries if the learner knows a special finite set of positive examples. This finite set is called a representative sample and has been introduced byAngluin Inform. Control 51 (1981) to show that regular languages are polynomial time learnable viamembership queries. If simple deterministic languages are learn...
متن کاملThe Learnability of Simple Deterministic Finite-Memory Automata
The present paper establishes the learnability of simple deterministic finitememory automata via membership and equivalence queries. Simple deterministic finite-memory automata are a subclass of deterministic finite-memory automata introduced by Kaminski and Francez [9] as a model generalizing finite-state automata to infinite alphabets. For arriving at a meaningful learning model we first prov...
متن کاملThe Learnability of Simple Deterministic Finite-memory Automata via Queries
In this paper, we establish the learnability of simple deterministic finitememory automata via membership and equivalence queries. Sim ple deterministic fmitememory automata are a subclass of finitememory automata introduced by Kaminski and Francez (1994) as a model gen eralizing finite automata to infinite alphabets. Continuously, Sakamoto and Ikeda investigated several decision problems for f...
متن کاملDeterministic Pda and Simple Languages 1 1
A context-free language is said to be simple if it is accepted by a single-state deterministic pushdown automaton with empty Stack acceptance. This paper proves that it is decidable whether a deterministic pushdown automaton (dpda) accepts a simple language. For this purpose, we prove that it is decidable whether a real-time dpda with empty stack acceptance accepts a simple language. To prove t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 1990
ISSN: 0885-6125,1573-0565
DOI: 10.1007/bf00116035